Search results for "probability of"
showing 10 items of 30 documents
Local Recruitment in the Greater Flamingo: A New Approach Using Capture- Mark-Recapture Data
1997
International audience; Although the establishment of new individuals in the breeding component of a population is an essential feature of population regulation, only a few attempts have been made to test biological hypotheses about recruitment. Most previous studies rely on ad hoc calculations or are flawed with unwarranted assumptions about survival. We use a recently developed approach, based on capture-mark-recapture, in which analysis of local recruitment is similar to a time-reversed analysis of survival. The basic data set consists of capture histories viewed in reverse order, with initial capture at year of birth, and subsequent observations corresponding to years when the animal ha…
ADME Prediction with KNIME: Development and Validation of a Publicly Available Workflow for the Prediction of Human Oral Bioavailability.
2020
In silico prediction of human oral bioavailability is a relevant tool for the selection of potential drug candidates and for the rejection of those molecules with less probability of success during the early stages of drug discovery and development. However, the high variability and complexity of oral bioavailability and the limited experimental data in the public domain have mainly restricted the development of reliable in silico models to predict this property from the chemical structure. In this study we present a KNIME automated workflow to predict human oral bioavailability of new drug and drug-like molecules based on five machine learning approaches combined into an ensemble model. Th…
Didactical note: probabilistic conditionality in a Boolean algebra
1996
This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling ``If-then" propositions. These operations, or Conditionals, are characterized under the hypothesis that they only obey to the Modus Ponens-Inequality, and it is shown that only six of them are boolean two-place functions. Is the Conditional Probability the Probability of a Conditional? This problem will be only considered, with the Material Conditional Operation, on a Boolean Algebra endowed with a finite probability and in three different cases: with the Internal-Conditional Probability, with th…
Grover’s Algorithm with Errors
2013
Grover’s algorithm is a quantum search algorithm solving the unstructured search problem of size n in \(O(\sqrt{n})\) queries, while any classical algorithm needs O(n) queries [3].
Entrepreneurship insolvency risk management: a case of Latvia
2011
Financial crisis and its consequences are visible in the capital adequacy of many commercial banks, which indicates that the approach banks took to assess credit risk was not sufficiently sophisticated. This article discusses practical methods of insolvency risk modelling for enterprises. In this paper, the authors analysed the accuracy of ten models developed by foreign authors to assess insolvency risk, which were validated on the database of Latvian companies. The authors have shown that models developed on historical data for foreign companies are less accurate than the model developed on the basis of financial indicators of Latvian companies. The authors developed a three-factor model …
Fostering novelty while reducing failure: Balancing the twin challenges of product innovation
2016
This paper aims to further our understanding of how the degrees of innovation novelty and innovation failure are connected. It argues that a better understanding of the specific predictors of innovation novelty and failure would improve our understanding of the innovation process and inform R&D managerial interventions to reduce the occurrences of failure and enhance radical innovation. This investigation draws on data on 5387 Spanish manufacturing firms from the 2009 Spanish Community Innovation Survey (CIS). Unlike prior studies which examine product innovation, degree of innovation novelty, and innovation failures in separate models, this study relies on a multivariate model to account f…
Probabilistic and team PFIN-type learning: General properties
2008
We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…
Optimal one-shot quantum algorithm for EQUALITY and AND
2017
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.
Finansinis stabilumas ir koncentracija: besivystančios Europos tyrimas
2016
Šiame straipsnyje tiriamas bankų sektoriaus koncentracijos poveikis finansiniam stabilumui naudojant 134 komercinių bankų iš 17 Vidurio ir Rytų Europos šalių 2007-2012 m. laikotarpio duomenis. Empirinio tyrimo rezultatai pabrėžia vadinamąją „koncentracijos trapumo“ hipotezę, parodydami, kad aukštas koncentracijos lygis bankų sektoriuje yra siejamas su didesne bankų, ypač mažesniųjų, įsipareigojimų neįvykdymo tikimybe. Taip pat parodoma, kad neigiamas koncentracijos poveikis gali būti sumažintas taikant griežtą priežiūros sistemą. Pirmiausia - griežtas oficialus bankų sektoriaus priežiūros įgaliojimas. Antra - skirtingi priimančiosios šalies ir buveinės šalies priežiūros įgaliojimai gali žym…
The probability that $x$ and $y$ commute in a compact group
2010
We show that a compact group $G$ has finite conjugacy classes, i.e., is an FC-group if and only if its center $Z(G)$ is open if and only if its commutator subgroup $G'$ is finite. Let $d(G)$ denote the Haar measure of the set of all pairs $(x,y)$ in $G \times G$ for which $[x,y] = 1$; this, formally, is the probability that two randomly picked elements commute. We prove that $d(G)$ is always rational and that it is positive if and only if $G$ is an extension of an FC-group by a finite group. This entails that $G$ is abelian by finite. The proofs involve measure theory, transformation groups, Lie theory of arbitrary compact groups, and representation theory of compact groups. Examples and re…